Performance Estimation of Parallel Discrete Event Simulation Using Synchronous Conservative Algorithm

نویسندگان

  • Mineo Takai
  • Tokuji Yamashiro
  • Seinosuke Narita
چکیده

Exploiting an eecient scheme for parallel discrete event simulation requires precise information about simulation runs. However, the virtual time synchronization algorithm gives rise to a wide gap between simple estimation and the actual simulation. This paper proposes a new performance estimation model for parallel simulation using synchronous conservative algorithm. The model assumes an exponential distribution for virtual time intervals between events. The result shows that the estimated execution time using the model is practically exact compared with the actual one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming Research Group Conservative Discrete-event Simulations on Bulk Synchronous Parallel Architectures Conservative Discrete-event Simulations on Bulk Synchronous Parallel Architectures

All the parallel discrete-event simulation algorithms developed so far have been designed to suit a speciic parallel model (e.g., a PRAM model, a MP-RAM model, etc.). This paper presents several versions of conservative parallel discrete-event simulation algorithms developed around a unifying model for general purpose parallel computer design and programming, namely around the Bulk Synchronous ...

متن کامل

Lookahead Accumulation in Conservative Parallel Discrete Event Simulation

Lookahead is a key issue in distributed discrete event simulation. It becomes explicit in conservative simulation algorithms, where the two major approaches are the asynchronous null-message (CMB) algorithms and the synchronous window algorithms (CTW). In this paper we demonstrate how a hybrid algorithm can maximize the lookahead capabilities of a model by lookahead accumulation. Furthermore, p...

متن کامل

Discrete-event simulation on the bulk-synchronous parallel model

The bulk-synchronous parallel (BSP) model of computing has been proposed to enable the development of portable software which achieves scalable performance across diverse parallel architectures. A number of applications of computing science have been demonstrated to be e ciently supported by the BSP model in practice. In this thesis we study the e cient realisation of parallel discrete-event si...

متن کامل

GVT algorithms and discrete event dynamics on 129K+ processor cores

Parallel discrete event simulation (PDES) represents a class of codes that are challenging to scale to large number of processors due to tight global timestamp-ordering and finegrained event execution. One of the critical factors in scaling PDES is the efficiency of the underlying global virtual time (GVT) algorithm needed for correctness of parallel execution and speed of progress. Although ma...

متن کامل

Parallel and Distributed Simulation of Discrete Event Systems

The achievements attained in accelerating the simulation of the dynamics of complex discrete event systems using parallel or distributed multiprocessing environments are comprehensively presented. While parallel discrete event simulation (DES) governs the evolution of the system over simulated time in an iterative SIMD way, distributed DES tries to spatially decompose the event structure underl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997